A mapping-based constraint-handling technique for evolutionary algorithms with its applications to portfolio optimization problems
نویسندگان
چکیده
A novel Constraint-Handling Technique (CHT) for Evolutionary Algorithms (EAs) applied to constrained optimization problems is proposed. It assumed that the feasible region of problem defined by a convex-hull multiple vertices. On other hand, without loss generality, search space EA given hyper-cube. The proposed CHT called Convex-Hull Mapping (CHM) transforms real vector in into solution region. also proven CHM performs surjective mapping from Although can be any EAs, one latest or Adaptive Differential Evolution (ADE), used this paper. By using ADE, compared with conventional CHTs real-world field finance, namely portfolio problem. Portfolio process determining best proportion investment different assets according some objective. Specifically, reveal characteristic depending on number above vertices, three formulations are employed evaluate performance ADE CHM. Numerical experiments show better than most cases. Moreover, hybrid method combining outperforms original CHT.
منابع مشابه
Study of the Sequential Constraint-handling Technique for Evolutionary Optimization with Application to Structural Problems
Engineering design problems are most frequently characterized by constraints that make them hard to solve and timeconsuming. When evolutionary algorithms are used to solve these problems, constraints are often handled with the generic weighted sum method or with techniques specific to the problem at hand. Most commonly, all constraints are evaluated at each generation, and it is also necessary ...
متن کاملMultiobjective Optimization and Multiple Constraint Handling with Evolutionary Algorithms
In this talk, fitness assignment in multiobjective evolutionary algorithms is interpreted as a multi-criterion decision process. A suitable decision making framework based on goals and priorities is formulated in terms of a relational operator, characterized, and shown to encompass a number of simpler decision strategies, including constraint satisfaction, lexicographic optimization, and a form...
متن کاملConstraint-Handling using an Evolutionary Multiobjective Optimization Technique
In this paper, we introduce the concept of non-dominance (commonly used in multiobjective optimization) as a way to incorporate constraints into the tness function of a genetic algorithm. Each individual is assigned a rank based on its degree of dominance over the rest of the population. Feasible individuals are always ranked higher than infeasible ones, and the degree of constraint violation d...
متن کاملA Survey of Constraint Handling Techniques used with Evolutionary Algorithms
Despite the extended applicability of evolutionary algorithms to a wide range of domains, the fact that these algorithms are unconstrained optimization techniques leaves open the issue regarding how to incorporate constraints of any kind (linear, non-linear, equality and inequality) into the tness function as to search eeciently. The main goal of this paper is to provide a detailed and comprehe...
متن کاملA constraint-guided method with evolutionary algorithms for economic problems
This paper presents an evolutionary algorithms based constrain-guidedmethod (CGM) that is capable of handling both hard and soft constraints in optimization problems. While searching for constraintsatisfied solutions, the method differentiates candidate solutions by assigning them with different fitness values, enabling favorite solutions to be distinguished more likely and more effectively from
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SICE Journal of Control, Measurement, and System Integration
سال: 2022
ISSN: ['1882-4889', '1884-9970']
DOI: https://doi.org/10.1080/18824889.2022.2040268